Some Observations on 1-Inkdot Alternating Multi-Counter Automata with Sublinear Space
نویسندگان
چکیده
This paper investigates some fundamental properties of 2-way alternating multi-counter automata (2amca’s) with only existential (universal) states which have sublinear space and 1 inkdot. It is shown that for any function s(n) ≥ log n such that log s(n) = o(log n), s(n) space-bounded 1-inkdot 2amca’s with only existential states are incomparable with the ones with only universal states, and the ones with only existential (universal) states are not closed under complementation. key words: alternating multi-counter automata, 1-inkdot, 2way computation, sublinear space complexity
منابع مشابه
Inkdot versus Pebble over Two-Dimensional Languages
This paper investigates a relationship between inkdot and one-pebble for two-dimensional finite automata (2-fa’s). Especially we show that (1) alternating inkdot 2-fa’s are more powerful than nondeterministic one-pebble 2-fa’s, and (2) there is a set accepted by an alternating inkdot 2-fa, but not accepted by any alternating one-pebble 2-fa with only universal states. key words: inkdot, pebble,...
متن کاملA Note on Realtime One-Way Synchronized Alternating One-Counter Automata
Hromko\ii-. J. and K. Inoue. A note on realtime one-\\ay synchronized alternating one-counter automata. Theoretical Computer Science 108 (1993) 393-400. This paper investigates the poner of realtime one-\+a> synchronized alternating one-counter automata (lsaca (1. real)sL and shous that (1) lsacall. realis are more powerful than real-time one-way nondeterministic multlcounter automata. and (7) ...
متن کاملMarker versus Inkdot on Four-Dimensional Tapes
A multi-marker automaton is a finite automaton which keeps marks as pebbles in the finite control, and cannot rewrite any input symbols but can make marks on its input with the restriction that only a bounded number of these marks can exist at any given time. An improvement of picture recognizability of the finite automaton is the reason why the multi-marker automaton was introduced. On the oth...
متن کاملClassical and quantum realtime alternating automata
We present some new results on realtime classical and quantum alternating models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we define realtime private alternating finite automata (PAFAs) and show that they can recognize some non-regular unary languages, and the emptiness problem is undecidable for them. Moreover, PA...
متن کاملReachability in Higher-Order-Counters
Higher-order counter automata (HOCA) can be either seen as a restriction of higher-order pushdown automata (HOPA) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of HOCA: those that can test whether the topmost counter value is zero and those which cannot. We show that control-state reachability for level k HOCA with 0-test ...
متن کامل